An Improved Approximation Factor For The Unit Disk Covering Problem
نویسندگان
چکیده
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on the method used. This is an improvement on the best known approximation factor of 108.
منابع مشابه
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph is contained in the subset or has a neighbor in the subset. A unit disk graph is a graph in which each vertex corresponds to a unit disk in the plane and two vertices are adjacent if and only if their disks have a non...
متن کاملImproved Algorithms for the Connected Sensor Cover Problem
Wireless sensor networks have recently posed many new system-building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active pro...
متن کاملImproved PTASs for Geometric Covering and Domination Problems with Cardinality Constraints
We studied the following two geometric optimization problems with cardinality constraints. • Capacitated covering with unit balls: Given a set of n points in R and a positive integer L, partition them into a minimum number of groups such that each group contains at most L points, and can be covered by a unit ball in R. • Capacitated connected dominating set in unit disk graph: Given a positive ...
متن کاملCovering Points by Unit Disks of Fixed Location
Given a set P of points in the plane, and a set D of unit disks of fixed location, the discrete unit disk cover problem is to find a minimum-cardinality subset D′ ⊆ D that covers all points of P . This problem is a geometric version of the general set cover problem, where the sets are defined by a collection of unit disks. It is still NP-hard, but while the general set cover problem is not appr...
متن کاملEfficient Approximation Schemes for Geometric Problems?
An EPTAS (efficient PTAS) is an approximation scheme where ǫ does not appear in the exponent of n, i.e., the running time is f(ǫ) ·n. We use parameterized complexity to investigate the possibility of improving the known approximation schemes for certain geometric problems to EPTAS. Answering an open question of Alber and Fiala [2], we show that Maximum Independent Set is W[1]-complete for the i...
متن کامل